Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access
نویسندگان
چکیده
Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. HEX-programs extend ASP with external atoms for access to arbitrary external information. In this work, we extend the evaluation principles of external atoms to partial assignments, lift nogood learning to this setting, and introduce a variant of nogood minimization. This enables external sources to guide the search for answer sets akin to theory propagation. Our benchmark experiments demonstrate a clear improvement in efficiency over the state-of-the-art HEX-solver.
منابع مشابه
Exploiting Support Sets for Answer Set Programs with External Evaluations
Answer set programs (ASP) with external evaluations are a declarative means to capture advanced applications. However, their evaluation can be expensive due to external source accesses. In this paper we consider HEX-programs that provide external atoms as a bidirectional interface to external sources and present a novel evaluation method based on support sets, which informally are portions of t...
متن کاملA model building framework for answer set programming with external computations
As software systems are getting increasingly connected, there is a need for equipping nonmonotonic logic programs with access to external sources that are possibly remote and may contain information in heterogeneous formats. To cater for this need, HEX programs were designed as a generalization of answer set programs with an API style interface that allows to access arbitrary external sources, ...
متن کاملLazy-Grounding for Answer Set Programs with External Source Access
HEX-programs enrich the well-known Answer Set Programming (ASP) paradigm. In HEX, problems are solved using nonmonotonic logic programs with bidirectional access to external sources. ASP evaluation is traditionally based on grounding the input program first, but recent advances in lazy-grounding make the latter also interesting for HEX, as the grounding bottleneck of ASP may be avoided. We expl...
متن کاملFast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS are two well-known such systems. They find an answer set from the full models for the completion of the input program, which is (iteratively) augmented with loop formulas. Making use of the fact that, for non-tight progr...
متن کاملEfficient Evaluation of Answer Set Programs with External Sources Based on External Source Inlining
HEX-programs are an extension of answer set programming (ASP) towards external sources. To this end, external atoms provide a bidirectional interface between the program and an external source. Traditionally, HEX-programs are evaluated using a rewriting to ordinary ASP programs which guess truth values of external atoms; this yields answer set candidates whose guesses are verified by evaluating...
متن کامل